Distance-regular graphs and the q-tetrahedron algebra
نویسندگان
چکیده
Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and b 6= 1, α = b − 1. The condition on α implies that Γ is formally self-dual. For b = q we use the adjacency matrix and dual adjacency matrix to obtain an action of the q-tetrahedron algebra ⊠q on the standard module of Γ. We describe four algebra homomorphisms into ⊠q from the quantum affine algebra Uq(ŝl2); using these we pull back the above ⊠q-action to obtain four actions of Uq(ŝl2) on the standard module of Γ.
منابع مشابه
Distance-regular graphs of q-Racah type and the q-tetrahedron algebra
In this paper we discuss a relationship between the following two algebras: (i) the subconstituent algebra T of a distance-regular graph that has q-Racah type; (ii) the q-tetrahedron algebra ⊠q which is a q-deformation of the three-point sl2 loop algebra. Assuming that every irreducible T -module is thin, we display an algebra homomorphism from ⊠q into T and show that T is generated by the imag...
متن کاملDistance-Regular Graphs Related to the Quantum Enveloping Algebra of sl(2)
We investigate a connection between distance-regular graphs and Uq (sl(2)), the quantum universal enveloping algebra of the Lie algebra sl(2). Let 0 be a distance-regular graph with diameter d ≥ 3 and valency k ≥ 3, and assume0 is not isomorphic to the d-cube. Fix a vertex x of0, and let T = T (x) denote the Terwilliger algebra of 0 with respect to x . Fix any complex number q 6∈ {0, 1,−1}. The...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملSome matrices associated with the split decomposition for a Q-polynomial distance-regular graph
We consider a Q-polynomial distance-regular graph Γ with vertex set X and diameter D ≥ 3. For μ, ν ∈ {↓, ↑} we define a direct sum decomposition of the standard module V = CX, called the (μ, ν)–split decomposition. For this decomposition we compute the complex conjugate and transpose of the associated primitive idempotents. Now fix b, β ∈ C such that b 6= 1 and assume Γ has classical parameters...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 30 شماره
صفحات -
تاریخ انتشار 2009